WSN Node Localization Regularization Algorithm Based on Quasi Optimal Criterion Parameter Selection

نویسندگان

  • Wang Lei
  • Cai Chen
چکیده

Node localization technology is one of the basic research fields in Wireless Sensor Networks (WSN) applications. The coordinates of the unknown nodes can be determined by the Least Square Estimate (LSE), which is commonly employed in the WSN node localization. Due to the influence of multi-path fading, the distance can be obtained from the Received Signal Strength Indicator (RSSI). But in the experiments and applications, it is found that different spatial positions of the anchor nodes and the errors of the distance measurement sometimes lead to large location errors, which is called ill-posed problem. To solve this problem, condition numbers are selected to diagnose the ill-posed degree. When the ill-posed degree is weak, the LSE method can be utilized to localize. When the ill-posed degree is serious, the ridge estimate method is proposed to weaken the ill-posed problem, and quasi optimal criterion is proposed to choose the regularization parameter. Test results indicate that the ridge estimate method dilutes the influence of ill-posed problem obviously, and the location errors can be reduced to around 4 meters. Copyright © 2013 IFSA.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node

Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In this paper we present a localization scheme with using only one mobile anchor station and received signal strength indicator tec...

متن کامل

On improving APIT algorithm for better localization in WSN

In Wireless Sensor Networks (WSNs), localization algorithms could be range-based or range-free. The Approximate Point in Triangle (APIT) is a range-free approach. We propose modification of the APIT algorithm and refer as modified-APIT. We select suitable triangles with appropriate distance between anchors to reduce PIT test errors (edge effect and non-uniform placement of neighbours) in APIT a...

متن کامل

Application of Rank Sequence Localization Algorithm based on Voronoi and Spearman in WSN

Node localization technology is a key technology of WSN, and this paper proposes a rank sequence localization algorithm based on Voronoi and Spearman. First of all, the paper divides the localization space of WSN according to the Voronoi diagram, takes the polygon’s points, center of gravity and the boundary intersection as virtual anchor nodes, and builds the rank sequence list for virtual anc...

متن کامل

Regularization Parameter Selection for Faulty Neural Networks

Regularization techniques have attracted many researches in the past decades. Most focus on designing the regularization term, and few on the optimal regularization parameter selection, especially for faulty neural networks. As is known that in the real world, the node faults often inevitably take place, which would lead to many faulty network patterns. If employing the conventional method, i.e...

متن کامل

Regularization independent of the noise level: an analysis of quasi-optimality

The quasi-optimality criterion chooses the regularization parameter in inverse problems without taking into account the noise level. This rule works remarkably well in practice, although Bakushinskii has shown that there are always counterexamples with very poor performance. We propose an average case analysis of quasi-optimality for spectral cut-off estimators and we prove that the quasi-optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013